Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach
نویسنده
چکیده
Multiplicative Linear Logic for Resource Transformation Nets p. 81 The Parameterized Complexity of Some Problems in Logic and Linguistics p. 89 Foundations of Proof Search Strategies Design in Linear Logic p. 101 On Extreme Points of Convex Compact Turing Located Set p. 114 Application of Typed Lambda Calculi in the Untyped Lambda Calculus p. 129 Classes with Pairwise Equivalent Enumerations p. 140 Strong Normalization in a Non-Deterministic Typed Lambda-Calculus p. 142 On Expressive Completeness of Modal Logic p. 153 Comparing Models of the Non-Extensional Typed Lambda-Calculus p. 164 Coalgebras and Approximation p. 173 Computational and Concurrency Models of Linear Logic p. 184 The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems p. 191 The Notion of Rank and Games p. 204 A Predictive Logic of Well-Founded Actions p. 218 Predictive Recurrence in Finite Types p. 227 Arity vs. Alternation in Second Order Logic p. 240 Hereditarily Sequential Functionals p. 253 Propositional Linear Temporal Logic and Language Homomorphisms p. 265 An Abstract Property of Confluence Applied to the Study of the Lazy Partial Lambda Calculus p. 278
منابع مشابه
Lower Bounds for One-way Probabilistic Communication Complexity
We prove three diierent types of complexity lower bounds for the one-way unbounded-error and bounded-error error probabilistic communication protocols for boolean functions. The lower bounds are proved in terms of the deterministic communication complexity of functions and in terms of the notion \probabilistic communication characteristic" that we deene. We present boolean functions with the di...
متن کاملGame Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without ε-transitions). We first show a general characterization of probabilistic bisimilarity in terms of two-player games, which naturally reduces checking ...
متن کاملProbabilistic Communication Complexity
Communication is a bottleneck in many distributed computations. In VLSI, communication constraints dictate lower bounds on the performance of chips. The two-processor information transfer model measures the communication requirements to compute functions. We study the unbounded error probabilistic version of this model. Because of its weak notion of correct output, we believe that this model me...
متن کاملProperties of Probabilistic Pushdown Automata
Properties of probabilistic as well as \probabilistic plus nondeterministic" pushdown automata and auxiliary pushdown automata are studied. These models are analogous to their counterparts with nondeterministic and alternating states. Complete characterizations in terms of well-known complexity classes are given for the classes of languages recognized by polynomial time-bounded, logarithmic spa...
متن کاملExperiments in Complexity of Probabilistic and Ultrametric Automata
We try to compare the complexity of deterministic, nondeterministic, probabilistic and ultrametric finite automata for the same language. We do not claim to have final upper and lower bounds. Rather these results can be considered as experiments to find advantages of one type of automata versus another type.
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کامل